Weakest Preconditions for High-Level Programs
نویسندگان
چکیده
In proof theory, a standard method for showing the correctness of a program w.r.t. given preand postconditions is to construct a weakest precondition and to show that the precondition implies the weakest precondition. In this paper, graph programs in the sense of Habel and Plump 2001 are extended to programs over high-level rules with application conditions, a formal definition of weakest preconditions for high-level programs in the sense of Dijkstra 1975 is given, and a construction of weakest preconditions is presented.
منابع مشابه
Weakest Preconditions for High-Level Programs (Long Version)
In proof theory, a standard method for showing the correctness of a program w.r.t. given preand postconditions is to construct a weakest precondition and to show that the precondition implies the weakest precondition. In this paper, graph programs in the sense of Habel and Plump 2001 are extended to programs over high-level rules with application conditions, a formal definition of weakest preco...
متن کاملENFORCe: A System for Ensuring Formal Correctness of High-level Programs
Graph programs allow a visual description of programs on graphs and graph-like structures. The correctness of a graph program with respect to a preand a postcondition can be shown in a classical way by constructing a weakest precondition of the program relative to the postcondition and checking whether the precondition implies the weakest precondition. ENFORCe is a currently developed system fo...
متن کاملSoundness of a purely syntactical formalizationof weakest preconditions
We present a purely syntactical deenition of E.W. Dijkstra's predicate transformer wp for nondeterministic while-programs in innnitary logic. Then we show that it is sound wrt. a deenition of weakest preconditions given in terms of denotational semantics.
متن کاملar X iv : 0 90 6 . 45 86 v 1 [ qu an t - ph ] 2 5 Ju n 20 09 Hoare Logic for Quantum Programs ∗
Hoare logic is a foundation of axiomatic semantics of classical programs and it provides effective proof techniques for reasoning about correctness of classical programs. To offer similar techniques for quantum program verification and to build a logical foundation of programming methodology for quantum computers, we develop a full-fledged Hoare logic for both partial and total correctness of q...
متن کاملProgramming Research Group a Weakest Precondition Semantics for Z (extended Version) a Weakest Precondition Semantics for Z (extended Version)
The lack of a method for developing programs from Z speciications is a diiculty widely recognised. In response to this problem, diierent approaches to the integration of Z with a reenement calculus have been proposed. These programming techniques are promising, but, as far as we know, have not been formalised. Since they are based on reenement calculi formalised in terms of weakest precondition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006